منابع مشابه
Orthogonal segment stabbing
We study a class of geometric stabbing/covering problems for sets of line segments, rays, and lines in the plane. While we demonstrate that the problems on sets of horizontal/vertical line segments are NP-complete, we show that versions involving (parallel) rays or lines are polynomially solvable.
متن کاملStabbing Orthogonal Objects in 3-Space
David M. Mount Fan-Tao Pu Department of Computer Science University of Maryland College Park, MD 20742 fmount,[email protected] 1 Motivation Computer graphics is the source of many interesting and challenging applications for the design of geometric algorithms and data structures. Applications in global illumination simulation and radiosity [7] have motivated our study of problems involving line...
متن کاملStabbing Convex Polygons with a Segment or a Polygon
Let O = {O1, . . . , Om} be a set of m convex polygons in R 2 with a total of n vertices, and let B be another convex k-gon. A placement of B, any congruent copy of B (without reflection), is called free if B does not intersect the interior of any polygon in O at this placement. A placement z of B is called critical if B forms three “distinct” contacts with O at z. Let φ(B,O) be the number of f...
متن کاملComputing conforming partitions of orthogonal polygons with minimum stabbing number
Let P be an orthogonal polygon with n vertices. A partition of P into rectangles is called conforming if it results from cutting P along a set of interior-disjoint line segments, each having both endpoints on the boundary of P . The stabbing number of a partition of P into rectangles is the maximum number of rectangles stabbed by any orthogonal line segment inside P . In this paper, we consider...
متن کاملStabbing Planes
We introduce and develop a new semi-algebraic proof system, called Stabbing Planes that is in the style of DPLL-based modern SAT solvers. As with DPLL, there is only one rule: the current polytope can be subdivided by branching on an inequality and its “integer negation.” That is, we can (nondeterministically choose) a hyperplane ax ≥ b with integer coefficients, which partitions the polytope i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2005
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2004.07.002